Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
نویسندگان
چکیده
منابع مشابه
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions” and numerical quantities. These techniques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system producing multi-criteria quality plans. The core of the syst...
متن کاملLocal Search Techniques for Temporal Planning in LPG
We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called “Tempo...
متن کاملLPG: A Planner Based on Local Search for Planning Graphs with Action Costs
We present LPG, a fast planner using local search for solving planning graphs. LPG can use various heuristics based on a parametrized objective function. These parameters weight different types of inconsistencies in the partial plan represented by the current search state, and are dynamically evaluated during search using Lagrange multipliers. LPG’s basic heuristic was inspired by Walksat, whic...
متن کاملTemporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of...
متن کاملPlanning with Derived Predicates Through Rule-Action Graphs and Local Search Techniques
In classical domain-independent planning, derived predicates are predicates that the domain actions can only indirectly affect. Their truth in a state can be inferred by particular axioms, that enrich the typical operator description of a planning domain. As discussed in [3,6], derived predicates are practically useful to express in a concise and natural way some indirect action effects, such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2003
ISSN: 1076-9757
DOI: 10.1613/jair.1183